Formally self-dual linear binary codes from circulant graphs

نویسندگان

  • Ruihu Li
  • Xueliang Li
  • Yaping Mao
  • Meiqin Wei
چکیده

In 2002, Tonchev first constructed some linear binary codes defined by the adjacency matrices of undirected graphs. So graph is an important tool for searching optimum code. In this paper, we introduce a new method of searching (proposed) optimum formally self-dual linear binary codes from circulant graphs. AMS Subject Classification 2010: 94B05, 05C50, 05C25.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computational Results of Duadic Double Circulant Codes

Quadratic residue codes have been one of the most important classes of algebraic codes. They have been generalized into duadic codes and quadratic double circulant codes. In this paper we introduce a new subclass of double circulant codes, called duadic double circulant codes, which is a generalization of quadratic double circulant codes for prime lengths. This class generates optimal self-dual...

متن کامل

Double circulant codes from two class association schemes

Two class association schemes consist of either strongly regular graphs (SRG) or doubly regular tournaments (DRT). We construct self-dual codes from the adjacency matrices of these schemes. This generalizes the construction of Pless ternary Symmetry codes, Karlin binary Double Circulant codes, Calderbank and Sloane quaternary double circulant codes, and Gaborit Quadratic Double Circulant codes ...

متن کامل

Directed graph representation of half-rate additive codes over GF(4)

Abstract. We show that (n, 2n) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to undirected graphs. Graph representation reduces the complexity of code classification, and enables us to classify additive (n, 2n) codes over GF(4) of length up to 7. From this we also derive classifications ...

متن کامل

New extremal binary self-dual codes of lengths 66 and 68 from codes over r_k, m

In this work, four circulant and quadratic double circulant (QDC) constructions are applied to the family of the rings R k,m. Self-dual binary codes are obtained as the Gray images of self-dual QDC codes over R k,m. Extremal binary self-dual codes of length 64 are obtained as Gray images of λ-four circulant codes over R 2,1 and R 2,2. Extremal binary self-dual codes of lengths 66 and 68 are con...

متن کامل

New extremal binary self-dual codes from F4+uF4-lifts of quadratic circulant codes over F4

In this work, quadratic double and quadratic bordered double circulant constructions are applied to F4 + uF4 as well as F4, as a result of which extremal binary self-dual codes of length 56 and 64 are obtained. The binary extension theorems as well as the ring extension version are used to obtain 7 extremal self-dual binary codes of length 58, 24 extremal self-dual binary codes of length 66 and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1402.6399  شماره 

صفحات  -

تاریخ انتشار 2014